Analysis of Reconfigurable Processors Using Petri Net
نویسندگان
چکیده
منابع مشابه
Petri Net Analysis Using Invariant Generation
Petri nets have been widely used to model and analyze concurrent systems. Their wide-spread use in this domain is, on one hand, facilitated by their simplicity and expressiveness. On the other hand, the analysis of Petri nets for questions like reachability, boundedness and deadlock freedom can be surprisingly hard. In this paper, we model Petri nets as transition systems. We exploit the specia...
متن کاملSymbolic Petri Net Analysis Using Boolean Manipulation
This work presents an ennumerative analysis approach for bounded Petri nets. The structure and behavior of the petri net are symbolically modeled by using boolean functions; thus, reducing reasoning about Petri nets to boolean calculation. The set of reachable markings is enumerated by symbolically ring the transitions in the Petri net. Highly concurrent Petri nets may suuer from the state expl...
متن کاملPetri Net Analysis Using Boolean Manipulation
This paper presents a novel analysis approach for bounded Petri nets. The net behavior is modeled by boolean functions, thus reducing reasoning about Petri nets to boolean calculation. The state explosion problem is managed by using Binary Decision Diagrams (BDDs), which are capable to represent large sets of markings in small data structures. The ability of Petri nets to model systems, the exi...
متن کاملBiochemical Reaction Pathway Analysis Using Petri Net
A systematic procedure has been developed to construct Petri net (PN) models for the biochemical reaction networks. The component models are first constructed for characterizing the elementary reactions and gene regulation mechanisms. These components are then assembled to model the entire reaction network. All possible reaction pathways leading to the desired product have been identified by th...
متن کاملA Petri Net Interpretation of Open Reconfigurable Systems
We present a Petri net interpretation of the pi-graphs a graphical variant of the pi-calculus. Characterizing labelled transition systems, the translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pi-graphs and their translated Petri nets agree at the semantic level. In consequence, existing results on pi-graphs naturally extend to the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Network and Information Security
سال: 2013
ISSN: 2074-9090,2074-9104
DOI: 10.5815/ijcnis.2013.09.04